The Size of the Giant Component of a Random Graph with a Given Degree Sequence
نویسندگان
چکیده
منابع مشابه
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Given a sequence of non negative real numbers which sum to we consider a random graph having approximately in ver tices of degree i In the authors essentially show that if P i i i then the graph a s has a giant component while if P i i i then a s all components in the graph are small In this paper we analyze the size of the giant component in the former case and the structure of the graph forme...
متن کاملEmergence and size of the giant component in clustered random graphs with a given degree distribution.
Standard techniques for analyzing network models usually break down in the presence of clustering. Here we introduce a new analytic tool, the "free-excess degree" distribution, which extends the generating function framework, making it applicable for clustered networks (C>0). The methodology is general and provides a new expression for the threshold point at which the giant component emerges an...
متن کاملThe Component Sizes of a Critical Random Graph with given Degree Sequence by Adrien Joseph
Consider a critical random multigraph Gn with n vertices constructed by the configuration model such that its vertex degrees are independent random variables with the same distribution ν (criticality means that the second moment of ν is finite and equals twice its first moment). We specify the scaling limits of the ordered sequence of component sizes of Gn as n tends to infinity in different ca...
متن کاملCover time of a random graph with given degree sequence
In this paper we establish the cover time of a random graph G(d) chosen uniformly at random from the set of graphs with vertex set [n] and degree sequence d. We show that under certain restrictions on d, the cover time of G(d) is whp asymptotic to d−1 d−2 θ dn log n. Here θ is the average degree and d is the effective minimum degree.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 1998
ISSN: 0963-5483
DOI: 10.1017/s0963548398003526